◀ Prev · Parts · Full

layout: Wide · Narrow · Centered

cite-note-22-88. ↑ citerefrothvo-2013Rothvoß, T. (2013-10-01). "Approximating Bin Packing within O(log OPT · Log Log OPT) Bins". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 20–29. arXiv:1301.4010. doi:10.1109/FOCS.2013.11. ISBN 978-0-7695-5135-7. S2CID 15905063.

cite-note-12-99. ↑ citerefkarmarkarkarp1982Karmarkar, Narendra; Karp, Richard M. (November 1982). "An efficient approximation scheme for the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982). pp. 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908.

cite-note-3-1010. ↑ citerefhobergrothvoss2017Hoberg, Rebecca; Rothvoss, Thomas (2017). "A Logarithmic Additive Integrality Gap for Bin Packing". Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 2616–2625. doi:10.1137/1.9781611974782.172. ISBN 978-1-61197-478-2. S2CID 1647463.

cite-note-24-1111. ↑ citerefcsirikjohnsonkenyon2001Csirik, Janos; Johnson, David S.; Kenyon, Claire (2001-01-09). "Better approximation algorithms for bin covering". SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics. pp. 557–566. ISBN 978-0-89871-490-6.

cite-note-32-1212. ↑ citerefjansensolis-oba2002Jansen, Klaus; Solis-Oba, Roberto (2002-11-21). "An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering". Algorithms and Computation. Lecture Notes in Computer Science. Vol. 2518. Springer-Verlag. pp. 175–186. doi:10.1007/3-540-36136-7_16. ISBN 978-3-540-00142-3.

◀ Prev · Parts · Full